A fast general algorithm for extracting image features on SIMD mesh-connected computers
نویسندگان
چکیده
Extracting features of components in an image is an important step for recognition of objects in the image. It is an intermediate-level image processing task as it transforms an image to a list of features. SIMD mesh-connected computers are considered natural architectures for low-level image processing tasks that transform an image into another image. In this paper, we design a fast general algorithm for extracting geometric features of image components, demonstrating that SIMD mesh-connected computers can also perform well on intermediate-level image processing tasks. We observe that a geometric feature of an image component is the combined contribution of the individual pixels in the component. We rst develop a general formula for extracting some geometric features of image components. A speciic geometric property of components, such as area, perimeter, compactness, height, width, diameter, moments, and centroid, can be computed by the general formula with a weight image specifying the contribution of each pixel to the property of the component it belongs to and an associative and commutative operator specifying how to combine the contributions. We then design a fast algorithm for the general formula on SIMD mesh-connected computers. The algorithm uses a pipelining technique to compute a geometric property of kn components at the same time. It takes O(d m kn en) time to compute a geometric property of all the components in an n n image on an n n SIMD mesh-connected computer with O(k) local space in each processing element, where m is the number of components in the image and k is an integer between 1 and d m n e, depending on the local memory available in each processing element. Compared with previous algorithms, it is simple and speeds up the feature extraction process by at least k times. Abstract { Extracting features of components in an image is an important step for recognition of objects in the image. In this paper, we develop a general formula for extracting some geometric features of image components such as area, perimeter, compactness, height, width, diameter, moments, and centroid. We then design a fast algorithm for the general formula on SIMD mesh-connected computers. The algorithm uses a pipelining technique to compute a geometric property of kn components at the same time. It takes O(d m kn en) time to compute a geometric property of all the components in an n n image on an n n SIMD mesh-connected computer …
منابع مشابه
A Fast Algorithm for Image Component Labeling with Local Operators on Mesh Connected Computers
A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented. This algorithm provides a positive answer to the open question whether there exists an O(n)–time and O(log n)–space local labeling algorithm on SIMD mesh connected computers. The algorithm uses a pipeline mechanism with stack–like data structures to achieve the lower bound o...
متن کاملParallel Enclosing Rectangle on Simd Machines 1
In this paper, we present a parallel algorithm for nding the smallest enclosing rectangle for a set of n points. The parallel algorithm can be generally implemented on mesh{connected and cube{connected SIMD computers with the time complexity O(p n) and O(log 2 n) respectively .
متن کاملGeneral Routing on the Lowest Level of the Image Understanding Architecture
SIMD mesh connected computers have been found to be very useful in many applications , such as those often found in image processing and matrix arithmetic, where the communication among PEs is local, regular, or both. Low eeciency results, however , when the communication patterns are irregular or sparse, a situation we have found to exist in many computer vision applications. This paper descri...
متن کامل1 An Environment - Projection Approach to Radiosity for Mesh - Connected Computers
We describe a progressive re nement radiosity algorithm for highly-parallel meshconnected SIMD or MIMD computers. The technique is based on environmentprojection and scales easily to large machines and datasets. Form-factor computations can be performed using local communication by mapping the single-plane across the processor mesh. We report on the performance of an implementation on the MasPa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 30 شماره
صفحات -
تاریخ انتشار 1997